A POPMUSIC matheuristic for the capacitated vehicle routing problem

This work proposes a partial optimization metaheuristic under special intensification conditions (POPMUSIC) for the classical capacitated vehicle routing problem. The proposed approach uses branch-cut-and-price algorithm as powerful heuristic to solve subproblems whose dimensions are typically between 25 and 200 customers. whole can be seen application of local search over very large neighborhoods, starting from single initial solution. main computational experiments were carried out on instances having 302 1000 Using solutions generated by some best available metaheuristics problem, POPMUSIC was able obtain consistently better long runs up 32 h. Starting known in CVRP library (CVRPLIB), find new several instances, including ones. In final experiment, we successfully applied same framework tackle heterogeneous fleet problem with backhauls.